An Efficient Semantic Search Scheme for Decentralized P2P Environment

Peer-to-peer (P2P) is becoming prevalent on the Internet. However, due to the nature of exact hash matching, the DHT-based P2P itself doesn’t support decentralized semantic search. In this letter, we propose a Decentralized Unicode Suffix Tree Overlay (DUSTO), which can support multiple languages and keywords search. The simulation results indicate the average search length of DUSTO method is 70.5% superior to Inverted Indexing and 59.8% better than DST method. The proposed DUSTO algorithm can be an efficient solution of the semantic and content search issue in the global P2P application environment.